From untangled graphs and nets to tangled materials
نویسندگان
چکیده
We suggest constructive definitions for the determination of untangled finite graphs and three-periodic nets, using barycentric embeddings in two and three dimensions. The possibility of deliberately constructing tangled graphs and nets is canvassed, and we conclude that tangled patterns offer a novel class of nanoand meso-structured materials with useful features, including high internal surface area and volume and chirality. Crown Copyright ! 2010 Published by Elsevier Masson SAS. All rights reserved.
منابع مشابه
Untangling Regulatory Text: Multidimensional Separation of Concerns and Task-Oriented Linking
Regulatory text is a complex network of information distinguished by technical language, large volume, and tangled concepts formed by embedded cross-references. Scattering and tangling add to the cognitive pressures on users of regulatory text. Multidimensional Separation of Concerns (MDSOC) is a software engineering method aimed at untangling source code objects that contain cross-cutting, ove...
متن کاملTrading spaces: building three-dimensional nets from two-dimensional tilings.
We construct some examples of finite and infinite crystalline three-dimensional nets derived from symmetric reticulations of homogeneous two-dimensional spaces: elliptic (S (2)), Euclidean (E (2)) and hyperbolic (H (2)) space. Those reticulations are edges and vertices of simple spherical, planar and hyperbolic tilings. We show that various projections of the simplest symmetric tilings of those...
متن کاملA Polynomial Bound for Untangling Geometric Planar Graphs
To untangle a geometric graph means to move some of the vertices so that the resulting geometric graph has no crossings. Pach and Tardos [Discrete Comput. Geom., 2002] asked if every n-vertex geometric planar graph can be untangled while keeping at least n vertices fixed. We answer this question in the affirmative with ǫ = 1/4. The previous best known bound was Ω( √ logn/ log logn). We also con...
متن کاملCompositional State Space Reduction Using Untangled Actions
We propose a compositional technique for efficient verification of networks of parallel processes. It is based on an automatic analysis of LTSs of individual processes (using a failure-based equivalence which preserves divergences) that determines their sets of “conflict-free” actions, called untangled actions. Untangled actions are compositional, i.e. synchronisation on untangled actions will ...
متن کاملTowards high-quality, untangled meshes via a force-directed graph embedding approach
High quality meshes are crucial for the solution of partial differential equations (PDEs) via the finite element method (or other PDE solvers). The accuracy of the PDE solution, and the stability and conditioning of the stiffness matrix depend upon the mesh quality. In addition, the mesh must be untangled in order for the finite element method to generate physically valid solutions. Tangled mes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014